A Multi-Attribute Auction Mechanism based on Conditional Constraints and Conditional Qualitative Preferences

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-Attribute Auction Mechanism based on Conditional Constraints and Conditional Qualitative Preferences

Auctioning multi-dimensional items is a key challenge, which requires rigorous tools. This study proposes a multi-round, first-score, semi-sealed multi-attribute reverse auction system. A fundamental concern in multiattribute auctions is acquiring a useful description of the buyers’ individuated requirements: hard constraints and qualitative preferences. To consider real requirements, we expres...

متن کامل

A Framework to Manage Conditional Constraints and Qualitative Preferences

A conditional CSP is a well known formalism for managing constraints in a dynamic environment where the possible changes are known a priori and can be enumerated beforehand. In this paper we argue that mixing preferences with Conditional CSPs brings more intuitive meaning to many real world applications. For example, in a product configuration problem the user preferences often co-exist with th...

متن کامل

Hard and soft constraints for reasoning about qualitative conditional preferences

Many real life optimization problems are defined in terms of both hard and soft constraints, and qualitative conditional preferences. However, there is as yet no single framework for combined reasoning about these three kinds of information. In this paper we study how to exploit classical and soft constraint solvers for handling qualitative preference statements such as those captured by the CP...

متن کامل

Conditional and Composite Constraints with Preferences

Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managing CSPs in a dynamic environment, in order to handle preferences. Unlike the existing CSP models managing one form of preferences, ours supports four types, namely : variable value and constraint preferences, composite...

متن کامل

Conditional, Hierarchical, Multi-Agent Preferences

We develop a revealed-preference theory for multiple agents. Some features of our construction, which draws heavily on Jeffrey's utility theory and on formal constructions by Domotor and Fishburn, are as follows. First, our system enjoys the "small-worlds" property. Second, it represents hierarchical preferences. As a result our expected utility representation is reminscent of type construction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of theoretical and applied electronic commerce research

سال: 2016

ISSN: 0718-1876

DOI: 10.4067/s0718-18762016000100002